# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def wordBreak(self, s: str, wordDict: List[str]) -> bool:
        str_len = len(s)
        dp = [False] * (str_len + 1)
        dp[0] = True

        # 将wordDict List转为Dict
        word_dict = {}
        for index, item in enumerate(wordDict):
            word_dict[item] = index

        word_count = len(wordDict)

        for j in range(1, str_len + 1):
            for i in range(0, j+1):
                sub_str = s[i:j]
                if word_dict.get(sub_str, -1) != -1 and dp[i]:
                    dp[j] = True
                    break

        return dp[-1]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ("aaaaaaa", ['aaaa', 'aaa'], True),
        ("leetcode", ["leet", "code"], True),
        ("applepenapple",  ["apple","pen"], True),
        ("catsandog", ["apple","pen"], False)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.wordBreak(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

